Number of states in DFA accepting the following language is: L =
|
Number of states in DFA accepting the following language is:
L = { an b2m | n, m ≥ 1 }A. n
B. 5
C. m
D. 2
Please scroll down to see the correct answer and solution guide.
Right Answer is: B
SOLUTION
Data
Language L = { an b2m | n, m ≥ 1 }
Concept
It is easier to find the minimized DFA if we find the NFA first.
NFA of the given language.
Converting this NFA into minimized DFA
Transition table
|
State |
Input a |
Input b |
|
1 |
2 |
Dead state |
|
2 |
2 |
3 |
|
3 |
Dead state |
4 |
|
4 |
Dead state |
3 |
|
Dead state |
Dead state |
Dead state |
Hence, number of states in DFA for the language L = { an b2m | n, m ≥ 1 } is 5.
